Refined Factorizations of Solvable Potentials
نویسنده
چکیده
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse and Coulomb potentials to obtain a wide set of raising and lowering operators, and to show clearly the connection that link these systems.
منابع مشابه
ua nt - p h / 99 10 03 8 v 1 8 O ct 1 99 9 Refined Factorizations of Solvable Potentials
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse and Coulomb potentials to obtain a wide set of raising and lowering operators, and to show clearly the connection that link these systems.
متن کاملRefined Enumeration of Minimal Transitive Factorizations of Permutations
Minimal transitive cycle factorizations, parking functions and labeled trees are related very closely. Using the correspondences between them, we find a refined enumeration of minimal transitive factorizations of permutations of type (1, n− 1) and (2, n− 2).
متن کاملGeneralized Factorizations of Words and Their Algorithmic Properties
We formalize the notion of a factorization of a word, a so-called F -factorization, introduced in [7] when solving some open problems on word equations. We show that most of the factorizations considered in the literature t well into that framework, and in particular that central algorithmic problems, such as the uniqueness or the synchronizability, remain polynomial time solvable for an import...
متن کامل1-factorizations of Cayley graphs on solvable groups
A well known unresolved conjecture states that every Cayley graph on a solvable group G has a 1-factorization. We show that if the commutator subgroup of of such a group is an elementary abelian p-group, then every quartic Cayley graph on G has a 1-factorization.
متن کاملA Refined Count of Coxeter Element Reflection Factorizations
For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections used from each orbit of hyperplanes. The proof is case-by-case via the classification of well-generated groups. It implies a new expression for the Coxeter ...
متن کامل